Towards Query Pricing on Incomplete Data
نویسندگان
چکیده
Data have significant economic or social value in many application fields including science, business, governance, etc. This naturally leads to the emergence of data markets such as GBDEx and YoueData. As a result, trade through has started receive attentions from both industry academia. During buying selling, how price is an indispensable problem. However, pricing incomplete more challenging, even though exist pervasively vast lot real-life scenarios. In this paper, we attempt explore pricing problem for queries over data . We propose sophisticated mechanism, termed ${\sf iDBPricer}$ , which takes series essential factors into consideration, data contribution/usage completeness query quality present two novel functions, namely, usage, completeness-aware function ( UCA price short) quality, QUCA short). Moreover, develop efficient algorithms deriving query prices. Extensive experiments using real benchmark datasets demonstrate excellent performance terms effectiveness scalability, compared with state-of-the-art functions.
منابع مشابه
Private Key based query on encrypted data
Nowadays, users of information systems have inclination to use a central server to decrease data transferring and maintenance costs. Since such a system is not so trustworthy, users' data usually upkeeps encrypted. However, encryption is not a nostrum for security problems and cannot guarantee the data security. In other words, there are some techniques that can endanger security of encrypted d...
متن کاملData exchange: query answering for incomplete data sources
Data exchange is the problem of transforming data structured under a schema, called the source schema, into data structured under another schema, called the target schema. Existing work on data exchange considers settings where the source instance does not contain incomplete information. In this paper we study semantics and address algorithmic issues for data exchange settings where the source ...
متن کاملTowards Efficient SPARQL Query Processing on RDF Data
Efficient support for querying large-scale RDF triples plays an important role in Semantic Web data management. This paper proposes an efficient RDF query engine to evaluate SPARQL queries, where the inverted index structure is employed for indexing RDF triples. We first design and implement a set of operators on the inverted index for query optimization and evaluation. Then we propose a main-t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Knowledge and Data Engineering
سال: 2022
ISSN: ['1558-2191', '1041-4347', '2326-3865']
DOI: https://doi.org/10.1109/tkde.2020.3026031